Data encoding method and device, storage medium, and processor

ABSTRACT

Provided are a data encoding method and device, a storage medium, and a processor. The method includes: obtaining data to be sent; performing quasi-cyclic low-density parity check (LDPC) encoding on the data to be sent to obtain an LDPC codeword sequence, and interleaving the LDPC codeword sequence to obtain an interleaved LDPC codeword sequence; performing cyclic bit selection on the interleaved LDPC codeword sequence from a starting position to obtain a rate-matched codeword sequence, where the starting position is determined according to a predetermined parameter; and sending the rate-matched codeword sequence. The solution above resolves the problem in the related art of unstable transmission after performing quasi-cyclic LDPC encoding on data to be transmitted, and achieves stable transmission after the quasi-cyclic LDPC encoding.

CROSS-REFERENCES TO RELATED APPLICATIONS

This patent document is a continuation of U.S. patent application Ser.No. 16/787,009, filed Feb. 10, 2020, which is a continuation of andclaims benefit of priority to International Patent Application No.PCT/CN2018/095037, filed on Jul. 9, 2018, which claims the benefit ofpriority of Chinese Patent Application No. 201710687764.6, filed on Aug.11, 2017. The entire contents of the before-mentioned patentapplications are incorporated by reference as part of the disclosure ofthis application.

TECHNICAL FIELD

The present invention relates to the field of communications and, inparticular, to a data encoding method and device, a storage medium and aprocessor.

BACKGROUND

In the relate art, for the problem in which in a quasi-cycliclow-density parity-check (LDPC) encoding process, once more padding bitsappear, an encoding or decoding efficiency of an LDPC code is reduced, atransport block size (TB S) table design rule is provided, such thatthere are as fewer as possible padding bits or no pad bit when the LDPCencoding is performed. For the problem of some cask effects caused bythe fact that the number of code blocks in each code block group in atransport block may be different, a Kmax design method in a code blockpartition method is provided, such that the number of code blocks ineach code block group is equal to avoid poor overall performance causedwhen some code block groups have more code blocks; and for the problemof poor performance of the quasi-cyclic LDPC encoding in a high-ordermodulation or a fading channel, the performance of the quasi-cyclic LDPCencoding is improved in a codeword interleaving method.

In an actual communication system, since the number of bits of atransport block that actually needs to be transmitted is not necessarilyequal to a system bit length supported by a quasi-cyclic LDPC encodingbasic matrix, code block partition needs to be performed on thetransport block and bits need to be padded. However, the code blockpartition performed on the transport block and the padded bit will causethe problem of unstable transmission, such as reduction of the encodingand decoding rate, high energy consumption, and influence on robustnessof data communication.

No effective solution to the problem of unstable transmission afterperforming quasi-cyclic LDPC encoding on data to be transmitted existsin the related art.

SUMMARY

Embodiments of the present invention provide a data encoding method anddevice, a storage medium, and a processor, to at least solve the problemin the related art of unstable transmission after performingquasi-cyclic LDPC encoding on data to be transmitted.

According to an embodiment of the present invention, a data encodingmethod is provided. The method incudes: performing quasi-cyclic LDPCencoding on an information packet bit sequence to obtain an LDPCcodeword sequence, and determining a size of a one-dimensionalfinite-length circular buffer according to the LDPC codeword sequence;selecting a redundancy version value from a plurality of predeterminedredundancy version values, and determining a starting position forreading a bit sequence to be transmitted in the one-dimensionalfinite-length circular buffer according to the selected redundancyversion value and a predefined parameter, where the predefined parameterincludes at least one of: a lifting size, the total number of columns ofa base graph matrix, the total number of rows of the base graph matrix,the number of system columns of the base graph matrix, or a length ofthe information packet bit sequence; and sequentially reading data bitswith a specific length from the starting position to form a bit sequenceto be transmitted, and sending the bit sequence to be transmitted.

According to another embodiment of the present invention, a dataencoding device is further provided. The device includes: an obtainingmodule, which is configured to obtain data to be sent; an interleavingmodule, which is configured to perform quasi-cyclic LDPC encoding on thedata to be sent to obtain an LDPC codeword sequence, and interleave theLDPC codeword sequence to obtain an interleaved LDPC codeword sequence;a selecting module, which is configured to perform cyclic bit selectionon the interleaved LDPC codeword sequence from a starting position toobtain a rate-matched codeword sequence, where the starting position isdetermined according to a predetermined parameter, where thepredetermined parameter includes at least one of: a redundancy version,a lifting size, the total number of columns of a base graph matrix, thetotal number of rows of the base graph matrix, the number of systemcolumns of the base graph matrix or a length of an information packetbit sequence; and a sending module, which is configured to send therate-matched codeword sequence.

According to another embodiment of the present invention, a storagemedium is further provided. The storage medium includes stored programswhich, when executed, execute the above-mentioned data encoding method.

According to another embodiment of the present invention, a processor isfurther provided. The processor is used for executing programs which,when executed, execute the above-mentioned data encoding method in theoptional embodiments described above.

Through the present invention, data to be sent is obtained; quasi-cyclicLDPC encoding is performed on the data to be sent to obtain an LDPCcodeword sequence, and the LDPC codeword sequence is interleaved toobtain an interleaved LDPC codeword sequence; cyclic bit selection isperformed on the interleaved LDPC codeword sequence from a startingposition to obtain a rate-matched codeword sequence, where the startingposition is determined according to a predetermined parameter; and therate-matched codeword sequence is sent. The solution above resolves theproblem in the related art of unstable transmission after performingquasi-cyclic LDPC encoding on data to be transmitted, and achievesstable transmission after the quasi-cyclic LDPC encoding.

BRIEF DESCRIPTION OF DRAWINGS

The drawings described herein are used to provide a furtherunderstanding of the present invention and form a part of the presentapplication. The exemplary embodiments and descriptions thereof in thepresent invention are used to explain the present invention and not tolimit the present invention in any improper way. In the drawings:

FIG. 1 is a flowchart of a data encoding method according to anembodiment of the present invention; and

FIG. 2 is a flowchart of an LDPC encoding data processing methodaccording to a preferred embodiment of the present invention.

DETAILED DESCRIPTION

Embodiments of the present application provide a mobile communicationnetwork (which includes, but is not limited to, a 5G mobilecommunication network). Network architecture of the network may includea network side device (such as a base station) and a terminal. Aninformation transmission method executable on the network architectureis provided in the embodiment. It is to be noted that an executionenvironment of the information transmission method provided by theembodiments of the present application is not limited to the networkarchitecture.

The related art of an encoding method in the digital communicationsystem will be briefly described before the embodiments of the presentinvention are described in detail.

The digital communication system in the related art generally includesthree parts: a transmitting end, a channel, and a receiving end. Thetransmitting end can perform channel encoding on an information sequenceto obtain an encoded codeword, interleave the encoded codeword, and mapinterleaved bits into modulation symbols, and then process and transmitthe modulation symbols according to communication channel information.In the channel, a specific channel response due to factors such asmultipath and movement results in distorted data transmission, and noiseand interference will further deteriorate the data transmission. Thereceiving end receives modulation symbol data after passing through thechannel, where the modulation symbol data has already been distorted atthis point, and needs to perform specific processing to restore theoriginal information sequence.

According to an encoding method used by the transmitting end forencoding the information sequence, the receiving end can performcorresponding processing on the received data to reliably restore theoriginal information sequence. Generally, the encoding method is basedon forward error correction (FEC) encoding. The FEC encoding adds someredundant information to the information sequence, and the receiving endcan reliably restore the original information sequence with theredundant information.

Some common FEC encoding includes: a convolutional code, a Turbo code,and an LDPC code. In the FEC encoding process, the FEC encoding isperformed on an information sequence with the number k of bits to obtainan FEC encoded codeword with n bits (including n-k redundancy bits), andan FEC encoding rate is kin. The LDPC code is a linear block codedefined with a very sparse parity check matrix or a bipartite graph. Thesparsity of the check matrix of the LDPC code helps achievelow-complexity encoding and decoding, thus making the LDPC morepractical. Various practices and theories prove that the LDPC code hasthe best channel encoding performance which is very close to the Shannonlimit under additive white Gaussian noise (AWGN). In the parity checkmatrix of the LDPC code, each row is a parity check code. If an elementvalue of a position of a certain index is equal to 1 in each row, itmeans that the bit at this position participates in the parity checkcode; if the element value is equal to 0, it means that the bit at thisposition does not participate in the parity check code.

Due to structured characteristics, a quasi-cyclic LDPC code has become amainstream application. For example, the quasi-cyclic LDPC code has beenwidely applied to IEEE802.11ac, IEEE802.11ad, IEEE802.11aj, IEEE802.16e,IEEE802.11n, microwave communications, and optical fiber communications,and is adopted as data channel encoding scheme in the 5th generation(5G) mobile communication. The parity check matrix H of the quasi-cyclicLDPC code is a matrix having M×Z rows and N×Z columns, which is composedof M×N sub-matrices. Each sub-matrix is a different power of a basicpermutation matrix with the size of Z×Z, that is, each sub-matrix isobtained after a cyclic shift of several values of an identity matrixwith the size of Z×Z.

To more easily describe the cyclic shift of the identity matrix from amathematical perspective, the parity check matrix of the quasi-cyclicLDPC code can be written as the following mathematical formula.

$H = {\begin{bmatrix}P^{{hhb}_{11}} & P^{{hb}_{12}} & P^{{hb}_{13}} & \ldots & P^{{hb}_{1N}} \\P^{{hb}_{21}} & P^{{hb}_{22}} & P^{{hb}_{23}} & \ldots & P^{{hb}_{2N}} \\\ldots & \ldots & \ldots & \; & \ldots \\P^{{hb}_{M\; 1}} & P^{{hb}_{M2}} & P^{{hb}_{M3}} & \ldots & P^{{hb}_{MN}}\end{bmatrix} = P^{Hb}}$

If hb_(ij)=−1, P^(hb) ^(ij) is an all-zero matrix with the size of Z×Z;otherwise, is a non-negative integer power of a standard permutationmatrix P. The standard permutation matrix P is written as follow.

$P = \begin{bmatrix}0 & 1 & 0 & \ldots & 0 \\0 & 0 & 1 & \ldots & 0 \\\ldots & \ldots & \ldots & \ldots & \ldots \\0 & 0 & 0 & \ldots & 1 \\1 & 0 & 0 & \ldots & 0\end{bmatrix}$

With this definition, Z and the power hb_(ij) can uniquely identify eachblock matrix. If a certain block matrix is an all-zero matrix, the blockmatrix can be represented by “−1” or a null value or in other forms. Ifthe block matrix is obtained through a cyclic shift of s of the identitymatrix, the block matrix is equal to s. All hb_(ij) can constitute abasic matrix Hb of the quasi-cyclic LDPC code, which can be written asfollow.

${Hb} = \begin{bmatrix}{hb}_{11} & {hb}_{12} & {hb}_{13} & \ldots & {hb}_{1N} \\{hb}_{21} & {hb}_{22} & {hb}_{23} & \ldots & {hb}_{2N} \\\ldots & \ldots & \ldots & \ldots & \ldots \\{hb}_{M\; 1} & {hb}_{M2} & {hb}_{M3} & \ldots & {hb}_{MN}\end{bmatrix}$

Therefore, the basic matrix Hb includes two types of elements: anelement indicating an all-zero square matrix, and an element indicatinga value of the cyclic shift of the identity matrix, which is generallyrepresented by an integer within a range of 0 to (Z−1). The basic matrixHb can be referred to as a basic check matrix or a shift value matrix ora permutation value matrix or a basic parity check matrix or a paritycheck matrix. In the basic matrix Hb, if the element indicating theall-zero matrix is replaced with an element “0”, and other elements arereplaced with elements, “1”, a base graph matrix or a template matrix ofthe quasi-cyclic LDPC encoding can be obtained. The base graph matrixmay also be described in a form of table. For example, row and columnindex pairs are used for indicating positions of “1” of the base graphmatrix or positions of elements indicating a value of the cyclic shiftof the identity matrix in the basic matrix. Therefore, the basis matrixof the quasi-cyclic LDPC code can be determined according to thetemplate matrix of the quasi-cyclic LDPC code and a group of shiftvalues (or coefficients). The dimension Z of the basic permutationmatrix or the all-zero square matrix can be defined as a shiftsize/lifting size or an expansion factor or a submatrix size.

Therefore, a structured LDPC code can be uniquely determined by thebasic check matrix Hb and the lifting size Z. For example, the basicmatrix Hb (with 2 rows and 4 columns) corresponds to the lifting size zof 4 and is written as follow.

${Hb} = \begin{bmatrix}0 & 1 & 0 & {- 1} \\2 & 1 & 2 & 1\end{bmatrix}$

The template matric corresponding to the basic matrix Hb is written asfollow.

${BG} = \begin{bmatrix}1 & 1 & 1 & 0 \\1 & 1 & 1 & 1\end{bmatrix}$

The parity check matrix H obtained according to the basic matrix Hb andthe lifting size Z is written as follow.

$H = \begin{bmatrix}1 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 1 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 1 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 \\0 & 0 & 0 & 1 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 \\0 & 0 & 1 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 1 & 0 & 0 \\0 & 0 & 0 & 1 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 1 & 0 \\1 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 1 \\0 & 1 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 1 & 0 & 0 & 0\end{bmatrix}$

The quasi-cyclic LDPC encoding can be directly performed according tothe parity check matrix determined according to the basic matrix Hb andthe lifting size Z. According to the definition of the LDPC code, H×C=0is satisfied; the H includes [Hs Hp], where Hs is a matrix of a systemcolumn part of the parity check matrix and Hp is a matrix of a checkcolumn part of the parity check matrix; the C can include [Cs Cp], whereCs is a system bit sequence (an information bit, a known bit) of theLDPC code and Cp is a check bit sequence (a unknown bit) of the LDPCcode. The LDPC encoding process is a process of calculating the checkbit sequence. Therefore, Hs×Cs=Hp×Cp, and then the check bit sequence Cpcan be calculated, that is, Cp=inv(Hp)×Hs×Cs, where the formula inv(x)represents binary inversion on a matrix x. Therefore, the matrix ofcheck columns of the parity check matrix must be a square matrix andbinary invertible, such that a quasi-cyclic LDPC encoded sequence is [CsCp]. Of course, the quasi-cyclic LDPC encoded sequence can also becalculated through the cyclic shift of each Z-bit block.

In the process of data transmission, the applicant finds that when thecode block partition is performed on the transport block and bits arepadded, for the LDPC code, the pad bits are used for assisting theencoding or decoding and dose not participate in the transmissionactually, but in the process of encoding and decoding, if more pad bitsappear, the encoder or the decoder will execute some useless operations,thereby reducing the encoding and decoding rate and causing high energyconsumption. If the length of the transport block is large, the numberof code blocks is large at this point. In order to facilitate feedbackand improve a processing efficiency, all LDPC code blocks need to bedivided in a plurality of code block group, where each code block groupincludes several LDPC coed blocks, and acknowledgement or negativeacknowledgement (ACK/NACK) feedback is received and data retransmissionis performed at the receiving end in the unit of code block groups. Ifthe design of code block groups is not considered in the process of codeblock partition, the number of code blocks in each code block group willbe different when the code blocks are divided into code block groups,which will cause some cask effects and affect the robustness of datacommunication. Since the quasi-cyclic LDPC encoding has certainstructured characteristics, in some high-order modulations or fadingchannels, the LDPC code may have some problems related to poorperformance. Therefore, the codeword bits need to be interleaved torandomize burst noise, thereby improving the performance of thequasi-cyclic LDPC codeword under the burst noise.

Embodiment One

The embodiment provides a data encoding method. FIG. 1 is a flowchart ofa data encoding method according to an embodiment of the presentinvention. As shown in FIG. 1 , the method includes the steps describedbelow.

In step S102, quasi-cyclic LDPC encoding is performed on an informationpacket bit sequence to obtain an LDPC codeword sequence, and a size of aone-dimensional finite-length circular buffer is determined according tothe LDPC codeword sequence.

In step S104, a redundancy version value is selected from a plurality ofpredetermined redundancy version values, and a starting position forreading a bit sequence to be transmitted in the one-dimensionalfinite-length circular buffer is determined according to the selectedredundancy version value and a predefined parameter, where thepredefined parameter includes at least one of: a lifting size, the totalnumber of columns of a base graph matrix, the total number of rows ofthe base graph matrix, the number of system columns of the base graphmatrix, or a length of the information packet bit sequence.

In step S106, data bits with a specific length are sequentially readfrom the starting position to form a bit sequence to be transmitted, andthe bit sequence to be transmitted is sent.

Through the above steps, quasi-cyclic LDPC encoding is performed on aninformation packet bit sequence to obtain an LDPC codeword sequence, anda size of a one-dimensional finite-length circular buffer is determinedaccording to the LDPC codeword sequence; a redundancy version value isselected from a plurality of predetermined redundancy version values,and a starting position for reading a bit sequence to be transmitted inthe one-dimensional finite-length circular buffer is determinedaccording to the selected redundancy version value and a predefinedparameter, where the predefined parameter includes at least one of: alifting size, the total number of columns of a base graph matrix, thetotal number of rows of the base graph matrix, the number of systemcolumns of the base graph matrix, or a length of the information packetbit sequence; and data bits with a specific length are sequentially readfrom the starting position to form a bit sequence to be transmitted, andthe bit sequence to be transmitted is sent. The solution above resolvesthe problem in the related art of unstable transmission after performingquasi-cyclic LDPC encoding on data to be transmitted, and achievesstable transmission after the quasi-cyclic LDPC encoding.

In one embodiment, the above steps may, but are not limited to, beexecuted by a base station or a terminal.

In one embodiment, the LDPC codeword sequence is interleaved to obtainan interleaved LDPC codeword sequence, and this step includes:performing block interleaving on the LDPC codeword sequence, where thenumber of rows of the interleaving matrix is determined according to thequasi-cyclic LDPC encoding parameter, and the quasi-cyclic LDPC encodingparameter includes at least one of: a lifting size, the total number ofcolumns of a base graph matrix, the total number of rows of the basegraph matrix, or the number of system columns of the base graph matrix.The interleaving matrix is interleaved in a manner in which data in thematrix is inputted along the column and outputted along the column.

In one embodiment, the number of rows of the interleaving matrix isequal to a positive integer factor of the quasi-cyclic LDPC liftingsize, or is equal to a positive integer multiple of a lifting size ofthe quasi-cyclic LDPC encoding.

In one embodiment, the number of rows of the interleaving matrix isequal to a positive integer factor of the total number of columns of thebase graph matrix of the quasi-cyclic LDPC encoding, or is equal to apositive integer multiple of the total number of columns of the basegraph matrix of the quasi-cyclic LDPC encoding.

In one embodiment, the interleaving method further includes: performingoutputting respectively according to a predetermined column order toobtain the interleaved codeword sequence.

In one embodiment, the intra-column interleaving method is determinedaccording to a modulation order.

Optionally, in condition that the modulation order is greater than M0,the intra-column interleaving method is executed, where the M0 is aninteger greater than 1.

In one embodiment, the starting position is determined according to theredundancy version, the lifting size and the total number of columns ofthe base graph matrix.

In one embodiment, the starting position corresponding to the redundancyversion being RV_(i) is calculated via the following formula:a first formula: S _(i)=α×function(β×(nb/G)×RV_(i)+χ)×Z+δ;

where, in the first formula, the nb is the total number of columns ofthe base graph matrix, Z is the lifting size, α is a positive integer, Gis a real number greater than 0, β is a positive real number, χ is anonnegative real number, and δ is an integer, where the function(x)represents rounding the real number x up to, or down to, or to a nearestinteger;or a second formula: S _(i)=α×(β×function(λ×nb/G)×RV_(i)+χ)×Z+δ;

where, in the second formula, the nb is the total number of columns ofthe base graph matrix, Z is the lifting size, α is a positive integer, Gis a real number greater than 0, β is a positive integer, the λ is apositive real number, χ is a nonnegative real number, and δ is aninteger, where the function(x) represents rounding the real number x upto, or down to, or to a nearest integer;or a third formula: S _(i)=α×(β×function(λ×nb×Z/G)×RV_(i)+χ)+δ;

where, in the third formula, the nb is the total number of columns ofthe base graph matrix, Z is the lifting size, G is a real number greaterthan 0, α is a positive integer, β is a positive integer, the λ is apositive real number, χ is a nonnegative real number, and δ is aninteger, where the function(x) represents rounding the real number x upto, or down to, or to a nearest integer.

In one embodiment, the starting position is determined according to theredundancy version, the lifting size, the total number of columns of thebase graph matrix and the length of the information packet bit sequence.

In one embodiment, the starting position corresponding to the redundancyversion being RV_(i) is calculated via one of following formulas:S _(i)=α×(β×function((K+mb×Z)/G)×RV_(i)+χ)+δ; andS _(i)=α×(β×function((K+mb×Z)/G)+χ)×RV_(i)+δ;

where in the above two formulas, K is the length of the informationpacket bit sequence, Z is the lifting size, G is a real number greaterthan 0, α is a positive integer, β is a positive integer, the λ is apositive real number, χ is a nonnegative real number, and δ is aninteger, where the function(x) represents rounding the real number x upto, or down to, or to a nearest integer.

In one embodiment, the step in which the LDPC codeword sequence isinterleaved to obtain the interleaved LDPC codeword sequence includes:interleaving all bits from the S0-th bit to the S1-th bit in the LDPCcodeword sequence, where S0 and S1 are positive integers, and S1 isgreater than the S0.

In one embodiment, the step in which all bits from the S0-th bit to theS1-th bit in the LDPC codeword sequence are interleaved includes:performing block interleaving on the all bits from the S0-th bit to theS1-th bit in the LDPC codeword sequence according to the interleavingmatrix, where the number of columns of the block interleaving matrix isZ0, and Z0 is determined by a quasi-cyclic LDPC encoding parameter,where the quasi-cyclic LDPC encoding parameter includes at least one of:a lifting size, the total number of columns of a base graph matrix, thetotal number of rows of the base graph matrix, the number of systemcolumns of the base graph matrix, or an information packet bit sequencelength.

In one embodiment, Z0 is equal to a positive integer factor of the LDPCencoding lifting size.

In one embodiment, Z0 is equal to Z, Z is the LDPC encoding liftingsize, S0 is equal to 2×Z, and S1 is equal to E×Z−1, where the E is aninteger greater than 2.

In one embodiment, the E is equal to kb, kb+1, kb+2, kb+3 or kb+4, wherethe kb is the number of system columns of the base graph matrix of theLDPC encoding.

In one embodiment, Z0 is determined by following parameters: S0, S1 anda modulation order, where the modulation order is the number of bitscarried by each modulation symbol.

In one embodiment, Z0 is calculated via the following formula:Z0=[(S1−S0+WM], where the M is the modulation order and is a positiveinteger.

In one embodiment, the value of S1 is determined via at least one offollowing parameters: a length of an information packet bit sequenceobtained after the code block partition is performed on the data to besent, and a length of a bit sequence to be transmitted.

In one embodiment, when an LDPC encoding rate R is less than or equal toR₀, the all bits from the S0-th bit to the S1-th bit in the LDPCcodeword sequence are interleaved according to the interleaving matrix,where the R₀ is a real number greater than or equal to ¾ and less than1, and the LDPC encoding rate R is equal to a quotient of the length ofan information packet bit sequence and the length of a bit sequence tobe transmitted.

The present invention will be described below in detail in conjunctionwith preferred embodiments.

Preferred Embodiment One

The embodiment provides a quasi-cyclic LDPC encoding data processingmethod which can be applied to a new radio access technology (NR)communication system. The method provided in this optional embodimentcan be applied to a Long Term Evolution (LTE) mobile communicationsystem or a future 5G mobile communication system or other wireless orwired communication systems, and the data transmission direction is adirection where a base station sends data to a mobile user (downlinktransmission of service data), or the data transmission direction is adirection where a mobile user sends data to a base station (uplinktransmission of service data). The mobile user includes: a mobiledevice, an access terminal, a user terminal, a user station, a userunit, a mobile station, a remote station, a remote terminal, a useragent, a user equipment, a user device, or devices named after otherterms. The base station includes: an access point (AP) which may bereferred to as a node B, a radio network controller (RNC), an evolvednode B (eNB), a base station controller (BSC), a base station controller(BTS), a base station (BS), a transceiver function (TF), a radio router,a radio transceiver, a basic service unit, an expansion service unit, aradio base station (RBS), or other devices named after other items.

According to one aspect of this optional embodiment, this optionalembodiment provides a quasi-cyclic LDPC encoding data processing methodwhich can be applied to an enhanced Mobile Broadband (eMBB) scenario, anUltra-Reliable and Low Latency Communications (URLLC) scenario or amassive Machine Type Communications (mMTC) scenario in the new radioaccess technology (new RAT).

FIG. 2 is a flowchart of an LDPC encoding data processing methodaccording to a preferred embodiment of the present invention. As shownin FIG. 2 , the method includes steps described below.

In step S201, length information of a source data packet to betransmitted is obtained, and a length of a source data packet to betransmitted which needs to be sent currently (also known as TBS) isdetermined from a TBS table according to control information, where thecontrol information can be obtained from downlink or uplink controlinformation or other system information.

In step S202, code block partition is performed. The source data packetto be transmitted is partitioned according to a length of a longestinformation block, K_(max), where the number of information packet bitsequences obtained after the partition is C=[K/(K_(max)−L)], and alength of the information packet bit sequence obtained after the codeblock partition includes K₊=[K/C] and K₊=[K/C], where the K is thelength of the information packet bit sequence and is a positive integer,the K_(max) is a positive integer, and the L is a length of a cyclicredundancy check (CRC) sequence added into each information packet bitsequence.

In step S203, a CRC sequence is added. A CRC sequence with the number Lof bits is added into each information bit block obtained after the codeblock partition, where the L is an integer greater than 0.

In step S204, a bit is padded. A sub-bit is padded in the informationbit block added with the CRC sequence, where the sub-bit is only usedfor assisting the encoding and does not participate in the transmission.

In step S205, the quasi-cyclic LDPC encoding is performed. A liftingsize used by the LDPC encoding is determined according to the length ofeach information packet bit sequence obtained after the code blockpartition, a check matrix of the LDPC encoding is determined andcalculated according to the obtained lifting size information, and thequasi-cyclic LDPC encoding is performed on each information packet bitsequence according to the check matrix and the LDPC encoding liftingsize to obtain an LDPC codeword sequence.

The base graph matrix of the quasi-cyclic LDPC encoding includes twotypes of base graph matrixes: base graph 1 and base graph 2. The numberof rows and columns of the base graph matrix, the base graph 1, are 46and 68 respectively, that is, the total number of columns of the basegraph matrix is 68, the total number of rows of the base graph matrix is46, and the number of system columns of the base graph matrix is68−46=22. The number of rows and columns of the base graph matrix, thebase graph 2, are 42 and 52 respectively, that is, the total number ofcolumns of the base graph matrix is 52, the total number of rows of thebase graph matrix is 42, and the number of system columns of the basegraph matrix is 52−42=10. According to the fact that the total number ofcolumns of the base graph matrix is 68 or the total number of rows ofthe base graph matrix is 46 or the number of system columns of the basegraph matrix is 22, it can be determined that an index corresponding tothe base graph matrix is 1 (base graph 1). According to the fact thatthe total number of columns of the base graph matrix is 52 or the totalnumber of rows of the base graph matrix is 42 or the number of systemcolumns of the base graph matrix is 10, it can be determined that anindex corresponding to the base graph matrix is 2 (base graph 2). Forexample, the table 1 shows a position of every element of value 1 withthe row index (i) in the base graph 1 and the base graph 2, that is, theposition can be replaced with a cyclic permutation identity matrixposition. The table 2 shows lifting sizes supported by the base graph 1,including 8 lifting size sets. The table 4 shows lifting sizes supportedby the base graph 2, also including 8 lifting size sets. A set indexi_(LS) of the lifting size set is determined according to the abovelifting size information. A shift value matrix of each lifting size setcorresponding to the base graph 1 is obtained from the table 3 accordingto the set index i_(LS), a shift value matrix of each lifting size setcorresponding to the base graph 2 is obtained from the table 5 accordingto the set index, and then the base graph matrix corresponding to thecurrent lifting size Z_(c) can be obtained according to the formula:P_(i,j)=mod(V_(i,j),Z_(c)). If the size of the information packet bitsequence is less than or equal to 2560 and the code rate is less than orequal to ⅔, the base graph 2 is selected, otherwise, the base graph 1 isselected. It is noted that in the table 1, the first column indicatesrow indices (i) of the base graph 1 and the base graph 2, the secondcolumn indicates column indices (j) of the base graph 1, and [i, j]determines the position of every element of value 1 of the base graph 1;besides, the third column indicates column indices (j) of the base graph2. The table 3 and the table 4 respectively show 8 shift value matrixescorresponding to the base graph 1 and the base graph 2, where the iindicates the row index, the j indicates the column index, and thei_(LS) indicates the set index of the lifting size set.

Table 1 Base graph 1 and base graph 2 are shown in Table 1 below.

Row Column indices (j) of Column indices (j) of index every element ofvalue every element of value (i) 1 for base graph 1 1 for base graph 2 00, 1, 2, 3, 5, 6, 9, 10, 11, 12, 0, 1, 2, 3, 6, 9, 10, 11 13, 15, 16,18, 19, 20, 21, 22, 23 1 0, 2, 3, 4, 5, 7, 8, 9, 11, 12, 0, 3, 4, 5, 6,7, 8, 9, 11, 12 14, 15, 16, 17, 19, 21, 22, 23, 24 2 0, 1, 2, 4, 5, 6,7, 8, 9, 10, 13, 0, 1, 3, 4, 8, 10, 12, 13 14, 15, 17, 18, 19, 20, 24,25 3 0, 1, 3, 4, 6, 7, 8, 10, 11, 12, 1, 2, 4, 5, 6, 7, 8, 9, 10, 13 13,14, 16, 17, 18, 20, 21, 22, 25 4 0, 1, 26 0, 1, 11, 14 5 0, 1, 3, 12,16, 21, 22, 27 0, 1, 5, 7, 11, 15 6 0, 6, 10, 11, 13, 17, 18, 20, 28 0,5, 7, 9, 11, 16 7 0, 1, 4, 7, 8, 14, 29 1, 5, 7, 11, 13, 17 8 0, 1, 3,12, 16, 19, 21, 22, 24, 30 0, 1, 12, 18 9 0, 1, 10, 11, 13, 17, 18, 20,31 1, 8, 10, 11, 19 10 1, 2, 4, 7, 8, 14, 32 0, 1, 6, 7, 20 11 0, 1, 12,16, 21, 22, 23, 33 0, 7, 9, 13, 21 12 0, 1, 10, 11, 13, 18, 34 1, 3, 11,22 13 0, 3, 7, 20, 23, 35 0, 1, 8, 13, 23 14 0, 12, 15, 16, 17, 21, 361, 6, 11, 13, 24 15 0, 1, 10, 13, 18, 25, 37 0, 10, 11, 25 16 1, 3, 11,20, 22, 38 1, 9, 11, 12, 26 17 0, 14, 16, 17, 21, 39 1, 5, 11, 12, 27 181, 12, 13, 18, 19, 40 0, 6, 7, 28 19 0, 1, 7, 8, 10, 41 0, 1, 10, 29 200, 3, 9, 11, 22, 42 1, 4, 11, 30 21 1, 5, 16, 20, 21, 43 0, 8, 13, 31 220, 12, 13, 17, 44 1, 2, 32 23 1, 2, 10, 18, 45 0, 3, 5, 33 24 0, 3, 4,11, 22, 46 1, 2, 9, 34 25 1, 6, 7, 14, 47 0, 5, 35 26 0, 2, 4, 15, 48 2,7, 12, 13, 36 27 1, 6, 8, 49 0, 6, 37 28 0, 4, 19, 21, 50 1, 2, 5, 38 291, 14, 18, 25, 51 0, 4, 39 30 0, 10, 13, 24, 52 2, 5, 7, 9, 40 31 1, 7,22, 25, 53 1, 13, 41 32 0, 12, 14, 24, 54 0, 5, 12, 42 33 1, 2, 11, 21,55 2, 7, 10, 43 34 0, 7, 15, 17, 56 0, 12, 13, 44 35 1, 6, 12, 22, 57 1,5, 11, 45 36 0, 14, 15, 18, 58 0, 2, 7, 46 37 1, 13, 23, 59 10, 13, 4738 0, 9, 10, 12, 60 1, 5, 11, 48 39 1, 3, 7, 19, 61 0, 7, 12, 49 40 0,8, 17, 62 2, 10, 13, 50 41 1, 3, 9, 18, 63 1, 5, 11, 51 42 0, 4, 24, 6443 1, 16, 18, 25, 65 44 0, 7, 9, 22, 66 45 1, 6, 10, 67

Table 2 Lifting sizes of base graph 1 are shown in Table 2 below.

Set index (i_(LS)) Set of lifting sizes 1 {2, 4, 8, 16, 32, 64, 128,256} 2 {3, 6, 12, 24, 48, 96, 192, 384} 3 {5, 10, 20, 40, 80, 160, 320}4 {7, 14, 28, 56, 112, 224} 5 {9, 18, 36, 72, 144, 288} 6 {11, 22, 44,88, 176, 352} 7 {13, 26, 52, 104, 208} 8 {15, 30, 60, 120, 240}

Table 3 Shift values of base graph 1 are shown in Table 3 below.

i_(LS) i j 1 2 3 4 5 6 7 8 0 0 250 307 73 223 211 294 0 135 1 69 19 1516 198 118 0 227 2 226 50 103 94 188 167 0 126 3 159 369 49 91 186 330 0134 5 100 181 240 74 219 207 0 84 6 10 216 39 10 4 165 0 83 9 59 317 150 29 243 0 53 10 229 288 162 205 144 250 0 225 11 110 109 215 216 116 10 205 12 191 17 164 21 216 339 0 128 13 9 357 133 215 115 201 0 75 15195 215 298 14 233 53 0 135 16 23 106 110 70 144 347 0 217 18 190 242113 141 95 304 0 220 19 35 180 16 198 216 167 0 90 20 239 330 189 104 7347 0 105 21 31 346 32 81 261 188 0 137 22 1 1 1 1 1 1 0 1 23 0 0 0 0 0 00 0 1 0 2 76 303 141 179 77 22 96 2 239 76 294 45 162 225 11 236 3 11773 27 151 223 96 124 136 4 124 288 261 46 256 338 0 221 5 71 144 161 119160 268 10 128 7 222 331 133 157 76 112 0 92 8 104 331 4 133 202 302 0172 9 173 178 80 87 117 50 2 56 11 220 295 129 206 109 167 16 11 12 102342 300 93 15 253 60 189 14 109 217 76 79 72 334 0 95 15 132 99 266 9152 242 6 85 16 142 354 72 118 158 257 30 153 17 155 114 83 194 147 1330 87 19 255 331 260 31 156 9 168 163 21 28 112 301 187 119 302 31 216 220 0 0 0 0 0 105 0 23 0 0 0 0 0 0 0 0 24 0 0 0 0 0 0 0 0 2 0 106 205 68207 258 226 132 189 1 111 250 7 203 167 35 37 4 2 185 328 80 31 220 21321 225 4 63 332 280 176 133 302 180 151 5 117 256 38 180 243 111 4 236 693 161 227 186 202 265 149 117 7 229 267 202 95 218 128 48 179 8 177 160200 153 63 237 38 92 9 95 63 71 177 0 294 122 24 10 39 129 106 70 3 127195 68 13 142 200 295 77 74 110 155 6 14 225 88 283 214 229 286 28 10115 225 53 301 77 0 125 85 33 17 245 131 184 198 216 131 47 96 18 205 240246 117 269 163 179 125 19 251 205 230 223 200 210 42 67 20 117 13 27690 234 7 66 230 24 0 0 0 0 0 0 0 0 25 0 0 0 0 0 0 0 0 3 0 121 276 220201 187 97 4 128 1 89 87 208 18 145 94 6 23 3 84 0 30 165 166 49 33 1624 20 275 197 5 108 279 113 220 6 150 199 61 45 82 139 49 43 7 131 153175 142 132 166 21 186 8 243 56 79 16 197 91 6 96 10 136 132 281 34 41106 151 1 11 86 305 303 155 162 246 83 216 12 246 231 253 213 57 345 15422 13 219 341 164 147 36 269 87 24 14 211 212 53 69 115 185 5 167 16 240304 44 96 242 249 92 200 17 76 300 28 74 165 215 173 32 18 244 271 77 990 143 120 235 20 144 39 319 30 113 121 2 172 21 12 357 68 158 108 121142 219 22 1 1 1 1 1 1 0 1 25 0 0 0 0 0 0 0 0 4 0 157 332 233 170 246 4224 64 1 102 181 205 10 235 256 204 211 26 0 0 0 0 0 0 0 0 5 0 205 195 83164 261 219 185 2 1 236 14 292 59 181 130 100 171 3 194 115 50 86 72 25124 47 12 231 166 318 80 283 322 65 143 16 28 241 201 182 254 295 207 21021 123 51 267 130 79 258 161 180 22 115 157 279 153 144 283 72 180 27 00 0 0 0 0 0 0 6 0 183 278 289 158 80 294 6 199 6 22 257 21 119 144 73 2722 10 28 1 293 113 169 330 163 23 11 67 351 13 21 90 99 50 100 13 244 92232 63 59 172 48 92 17 11 253 302 51 177 150 24 207 18 157 18 138 136151 284 38 52 20 211 225 235 116 108 305 91 13 28 0 0 0 0 0 0 0 0 7 0220 9 12 17 169 3 145 77 1 44 62 88 76 189 103 88 146 4 159 316 207 104154 224 112 209 7 31 333 50 100 184 297 153 32 8 167 290 25 150 104 215159 166 14 104 114 76 158 164 39 76 18 29 0 0 0 0 0 0 0 0 8 0 112 307295 33 54 348 172 181 1 4 179 133 95 0 75 2 105 3 7 165 130 4 252 22 131141 12 211 18 231 217 41 312 141 223 16 102 39 296 204 98 224 96 177 19164 224 110 39 46 17 99 145 21 109 368 269 58 15 59 101 199 22 241 67245 44 230 314 35 153 24 90 170 154 201 54 244 116 38 30 0 0 0 0 0 0 0 09 0 103 366 189 9 162 156 6 169 1 182 232 244 37 159 88 10 12 10 109 32136 213 93 293 145 206 11 21 133 286 105 134 111 53 221 13 142 57 151 8945 92 201 17 17 14 303 267 185 132 152 4 212 18 61 63 135 109 76 23 16492 20 216 82 209 218 209 337 173 205 31 0 0 0 0 0 0 0 0 10 1 98 101 1482 178 175 126 116 2 149 339 80 165 1 253 77 151 4 167 274 211 174 28 27156 70 7 160 111 75 19 267 231 16 230 8 49 383 161 194 234 49 12 115 1458 354 311 103 201 267 70 84 32 0 0 0 0 0 0 0 0 11 0 77 48 16 52 55 25184 45 1 41 102 147 11 23 322 194 115 12 83 8 290 2 274 200 123 134 16182 47 289 35 181 351 16 1 21 78 188 177 32 273 166 104 152 22 252 33443 84 39 338 109 165 23 22 115 280 201 26 192 124 107 33 0 0 0 0 0 0 0 012 0 160 77 229 142 225 123 6 186 1 42 186 235 175 162 217 20 215 10 21174 169 136 244 142 203 124 11 32 232 48 3 151 110 153 180 13 234 50 10528 238 176 104 98 18 7 74 52 182 243 76 207 80 34 0 0 0 0 0 0 0 0 13 0177 313 39 81 231 311 52 220 3 248 177 302 56 0 251 147 185 7 151 266303 72 216 265 1 154 20 185 115 160 217 47 94 16 178 23 62 370 37 78 3681 46 150 35 0 0 0 0 0 0 0 0 14 0 206 142 78 14 0 22 1 124 12 55 248 299175 186 322 202 144 15 206 137 54 211 253 277 118 182 16 127 89 61 19116 156 130 95 17 16 347 179 51 0 66 1 72 21 229 12 258 43 79 78 2 76 360 0 0 0 0 0 0 0 15 0 40 241 229 90 170 176 173 39 1 96 2 290 120 0 348 6138 10 65 210 60 131 183 15 81 220 13 63 318 130 209 108 81 182 173 1875 55 184 209 68 176 53 142 25 179 269 51 81 64 113 46 49 37 0 0 0 0 0 00 0 16 1 64 13 69 154 270 190 88 78 3 49 338 140 164 13 293 198 152 1149 57 45 43 99 332 160 84 20 51 289 115 189 54 331 122 5 22 154 57 300101 0 114 182 205 38 0 0 0 0 0 0 0 0 17 0 7 260 257 56 153 110 91 183 14164 303 147 110 137 228 184 112 16 59 81 128 200 0 247 30 106 17 1 35851 63 0 116 3 219 21 144 375 228 4 162 190 155 129 39 0 0 0 0 0 0 0 0 181 42 130 260 199 161 47 1 183 12 233 163 294 110 151 286 41 215 13 8 280291 200 0 246 167 180 18 155 132 141 143 241 181 68 143 19 147 4 295 186144 73 148 14 40 0 0 0 0 0 0 0 0 19 0 60 145 64 8 0 87 12 179 1 73 213181 6 0 110 6 108 7 72 344 101 103 118 147 166 159 8 127 242 270 198 144258 184 138 10 224 197 41 8 0 204 191 196 41 0 0 0 0 0 0 0 0 20 0 151187 301 105 265 89 6 77 3 186 206 162 210 81 65 12 187 9 217 264 40 12190 155 15 203 11 47 341 130 214 144 244 5 167 22 160 59 10 183 228 30 30130 42 0 0 0 0 0 0 0 0 21 1 249 205 79 192 64 162 6 197 5 121 102 175131 46 264 86 122 16 109 328 132 220 266 346 96 215 20 131 213 283 50 9143 42 65 21 171 97 103 106 18 109 199 216 43 0 0 0 0 0 0 0 0 22 0 64 30177 53 72 280 44 25 12 142 11 20 0 189 157 58 47 13 188 233 55 3 72 236130 126 17 158 22 316 148 257 113 131 178 44 0 0 0 0 0 0 0 0 23 1 156 24249 88 180 18 45 185 2 147 89 50 203 0 6 18 127 10 170 61 133 168 0 181132 117 18 152 27 105 122 165 304 100 199 45 0 0 0 0 0 0 0 0 24 0 112298 289 49 236 38 9 32 3 86 158 280 157 199 170 125 178 4 236 235 110 640 249 191 2 11 116 339 187 193 266 288 28 156 22 222 234 281 124 0 194 658 46 0 0 0 0 0 0 0 0 25 1 23 72 172 1 205 279 4 27 6 136 17 295 166 0255 74 141 7 116 383 96 65 0 111 16 11 14 182 312 46 81 183 54 28 181 470 0 0 0 0 0 0 0 26 0 195 71 270 107 0 325 21 163 2 243 81 110 176 0 326142 131 4 215 76 318 212 0 226 192 169 15 61 136 67 127 277 99 197 98 480 0 0 0 0 0 0 0 27 1 25 194 210 208 45 91 98 165 6 104 194 29 141 36 326140 232 8 194 101 304 174 72 268 22 9 49 0 0 0 0 0 0 0 0 28 0 128 222 11146 275 102 4 32 4 165 19 293 153 0 1 1 43 19 181 244 50 217 155 40 40200 21 63 274 234 114 62 167 93 205 50 0 0 0 0 0 0 0 0 29 1 86 252 27150 0 273 92 232 14 236 5 308 11 180 104 136 32 18 84 147 117 53 0 243106 118 25 6 78 29 68 42 107 6 103 51 0 0 0 0 0 0 0 0 30 0 216 159 91 340 171 2 170 10 73 229 23 130 90 16 88 199 13 120 260 105 210 252 95 11226 24 9 90 135 123 173 212 20 105 52 0 0 0 0 0 0 0 0 31 1 95 100 222 175144 101 4 73 7 177 215 308 49 144 297 49 149 22 172 258 66 177 166 279125 175 25 61 256 162 128 19 222 194 108 53 0 0 0 0 0 0 0 0 32 0 221 102210 192 0 351 6 103 12 112 201 22 209 211 265 126 110 14 199 175 271 5836 338 63 151 24 121 287 217 30 162 83 20 211 54 0 0 0 0 0 0 0 0 33 1 2323 170 114 0 56 10 199 2 187 8 20 49 0 304 30 132 11 41 361 140 161 76141 6 172 21 211 105 33 137 18 101 92 65 55 0 0 0 0 0 0 0 0 34 0 127 230187 82 197 60 4 161 7 167 148 296 186 0 320 153 237 15 164 202 5 68 108112 197 142 17 159 312 44 150 0 54 155 180 56 0 0 0 0 0 0 0 0 35 1 161320 207 192 199 100 4 231 6 197 335 158 173 278 210 45 174 12 207 2 5526 0 195 168 145 22 103 266 285 187 205 268 185 100 57 0 0 0 0 0 0 0 036 0 37 210 259 222 216 135 6 11 14 105 313 179 157 16 15 200 207 15 51297 178 0 0 35 177 42 18 120 21 160 6 0 188 43 100 58 0 0 0 0 0 0 0 0 371 198 269 298 81 72 319 82 59 13 220 82 15 195 144 236 2 204 23 122 115115 138 0 85 135 161 59 0 0 0 0 0 0 0 0 38 0 167 185 151 123 190 164 91121 9 151 177 179 90 0 196 64 90 10 157 289 64 73 0 209 198 26 12 163214 181 10 0 246 100 140 60 0 0 0 0 0 0 0 0 39 1 173 258 102 12 153 2364 115 3 139 93 77 77 0 264 28 188 7 149 346 192 49 165 37 109 168 19 0297 208 114 117 272 188 52 61 0 0 0 0 0 0 0 0 40 0 157 175 32 67 216 30410 4 8 137 37 80 45 144 237 84 103 17 149 312 197 96 2 135 12 30 62 0 00 0 0 0 0 0 41 1 167 52 154 23 0 123 2 53 3 173 314 47 215 0 77 75 189 9139 139 124 60 0 25 142 215 18 151 288 207 167 183 272 128 24 63 0 0 0 00 0 0 0 42 0 149 113 226 114 27 288 163 222 4 157 14 65 91 0 83 10 17024 137 218 126 78 35 17 162 71 64 0 0 0 0 0 0 0 0 43 1 151 113 228 20652 210 1 22 16 163 132 69 22 243 3 163 127 18 173 114 176 134 0 53 99 4925 139 168 102 161 270 167 98 125 65 0 0 0 0 0 0 0 0 44 0 139 80 234 8418 79 4 191 7 157 78 227 4 0 244 6 211 9 163 163 259 9 0 293 142 187 22173 274 260 12 57 272 3 148 66 0 0 0 0 0 0 0 0 45 1 149 135 101 184 16882 181 177 6 151 149 228 121 0 67 45 114 10 167 15 126 29 144 235 153 9367 0 0 0 0 0 0 0 0

Table 4 Lifting sizes of base graph 2 are shown in Table 4 below.

Set index (i_(LS)) Set of lifting sizes 1 {2, 4, 8, 16, 32, 64, 128,256} 2 {3, 6, 12, 24, 48, 96, 192} 3 {5, 10, 20, 40, 80, 160} 4 {7, 14,28, 56, 112, 224} 5 {9, 18, 36, 72, 144} 6 {11, 22, 44, 88, 176} 7 {13,26, 52, 104, 208} 8 {15, 30, 60, 120, 240}

Table 5 Shift values of base graph 2 are shown in Table 5 below.

i_(LS) i j 1 2 3 4 5 6 7 8 0 0 9 174 0 72 3 156 143 145 1 117 97 0 11026 143 19 131 2 204 166 0 23 53 14 176 71 3 26 66 0 181 35 3 165 21 6189 71 0 95 115 40 196 23 9 205 172 0 8 127 123 13 112 10 0 0 0 1 0 0 01 11 0 0 0 0 0 0 0 0 1 0 167 27 137 53 19 17 18 142 3 166 36 124 156 9465 27 174 4 253 48 0 115 104 63 3 183 5 125 92 0 156 66 1 102 27 6 22631 88 115 84 55 185 96 7 156 187 0 200 98 37 17 23 8 224 185 0 29 69 17114 9 9 252 3 55 31 50 133 180 167 11 0 0 0 0 0 0 0 0 12 0 0 0 0 0 0 0 02 0 81 25 20 152 95 98 126 74 1 114 114 94 131 106 168 163 31 3 44 11799 46 92 107 47 3 4 52 110 9 191 110 82 183 53 8 240 114 108 91 111 142132 155 10 1 1 1 0 1 1 1 0 12 0 0 0 0 0 0 0 0 13 0 0 0 0 0 0 0 0 3 1 8136 38 185 120 53 36 239 2 58 175 15 6 121 174 48 171 4 158 113 102 3622 174 18 95 5 104 72 146 124 4 127 111 110 6 209 123 12 124 73 17 203159 7 54 118 57 110 49 89 3 199 8 18 28 53 156 128 17 191 43 9 128 18646 133 79 105 160 75 10 0 0 0 1 0 0 0 1 13 0 0 0 0 0 0 0 0 4 0 179 72 0200 42 86 43 29 1 214 74 136 16 24 67 27 140 11 71 29 157 101 51 83 117180 14 0 0 0 0 0 0 0 0 5 0 231 10 0 185 40 79 136 121 1 41 44 131 138140 84 49 41 5 194 121 142 170 84 35 36 169 7 159 80 141 219 137 103 13288 11 103 48 64 193 71 60 62 207 15 0 0 0 0 0 0 0 0 6 0 155 129 0 123109 47 7 137 5 228 92 124 55 87 154 34 72 7 45 100 99 31 107 10 198 1729 28 49 45 222 133 155 168 124 11 158 184 148 209 139 29 12 56 16 0 0 00 0 0 0 0 7 1 129 80 0 103 97 48 163 86 5 147 186 45 13 135 125 78 186 7140 16 148 105 35 24 143 87 11 3 102 96 150 108 47 107 172 13 116 143 78181 65 55 58 154 17 0 0 0 0 0 0 0 0 8 0 142 118 0 147 70 53 101 176 1 9470 65 43 69 31 177 169 12 230 152 87 152 88 161 22 225 18 0 0 0 0 0 0 00 9 1 203 28 0 2 97 104 186 167 8 205 132 97 30 40 142 27 238 10 61 18551 184 24 99 205 48 11 247 178 85 83 49 64 81 68 19 0 0 0 0 0 0 0 0 10 011 59 0 174 46 111 125 38 1 185 104 17 150 41 25 60 217 6 0 22 156 8 101174 177 208 7 117 52 20 56 96 23 51 232 20 0 0 0 0 0 0 0 0 11 0 11 32 099 28 91 39 178 7 236 92 7 138 30 175 29 214 9 210 174 4 110 116 24 35168 13 56 154 2 99 64 141 8 51 21 0 0 0 0 0 0 0 0 12 1 63 39 0 46 33 12218 124 3 111 93 113 217 122 11 155 122 11 14 11 48 109 131 4 49 72 22 00 0 0 0 0 0 0 13 0 83 49 0 37 76 29 32 48 1 2 125 112 113 37 91 53 57 838 35 102 143 62 27 95 167 13 222 166 26 140 47 127 186 219 23 0 0 0 0 00 0 0 14 1 115 19 0 36 143 11 91 82 6 145 118 138 95 51 145 20 232 11 321 57 40 130 8 52 204 13 232 163 27 116 97 166 109 162 24 0 0 0 0 0 0 00 15 0 51 68 0 116 139 137 174 38 10 175 63 73 200 96 103 108 217 11 21381 99 110 128 40 102 157 25 0 0 0 0 0 0 0 0 16 1 203 87 0 75 48 78 125170 9 142 177 79 158 9 158 31 23 11 8 135 111 134 28 17 54 175 12 242 64143 97 8 165 176 202 26 0 0 0 0 0 0 0 0 17 1 254 158 0 48 120 134 57 1965 124 23 24 132 43 23 201 173 11 114 9 109 206 65 62 142 195 12 64 6 182 42 163 35 218 27 0 0 0 0 0 0 0 0 18 0 220 186 0 68 17 173 129 128 6194 6 18 16 106 31 203 211 7 50 46 86 156 142 22 140 210 28 0 0 0 0 0 00 0 19 0 87 58 0 35 79 13 110 39 1 20 42 158 138 28 135 124 84 10 185156 154 86 41 145 52 88 29 0 0 0 0 0 0 0 0 20 1 26 76 0 6 2 128 196 1174 105 61 148 20 103 52 35 227 11 29 153 104 141 78 173 114 6 30 0 0 0 00 0 0 0 21 0 76 157 0 80 91 156 10 238 8 42 175 17 43 75 166 122 13 13210 67 33 81 81 40 23 11 31 0 0 0 0 0 0 0 0 22 1 222 20 0 49 54 18 202195 2 63 52 4 1 132 163 126 44 32 0 0 0 0 0 0 0 0 23 0 23 106 0 156 68110 52 5 3 235 86 75 54 115 132 170 94 5 238 95 158 134 56 150 13 111 330 0 0 0 0 0 0 0 24 1 46 182 0 153 30 113 113 81 2 139 153 69 88 42 108161 19 9 8 64 87 63 101 61 88 130 34 0 0 0 0 0 0 0 0 25 0 228 45 0 211128 72 197 66 5 156 21 65 94 63 136 194 95 35 0 0 0 0 0 0 0 0 26 2 29 670 90 142 36 164 146 7 143 137 100 6 28 38 172 66 12 160 55 13 221 100 5349 190 13 122 85 7 6 133 145 161 86 36 0 0 0 0 0 0 0 0 27 0 8 103 0 2713 42 168 64 6 151 50 32 118 10 104 193 181 37 0 0 0 0 0 0 0 0 28 1 9870 0 216 106 64 14 7 2 101 111 126 212 77 24 186 144 5 135 168 110 19343 149 46 16 38 0 0 0 0 0 0 0 0 29 0 18 110 0 108 133 139 50 25 4 28 17154 61 25 161 27 57 39 0 0 0 0 0 0 0 0 30 2 71 120 0 106 87 84 70 37 5240 154 35 44 56 173 17 139 7 9 52 51 185 104 93 50 221 9 84 56 134 17670 29 6 17 40 0 0 0 0 0 0 0 0 31 1 106 3 0 147 80 117 115 201 13 1 17020 182 139 148 189 46 41 0 0 0 0 0 0 0 0 32 0 242 84 0 108 32 116 110179 5 44 8 20 21 89 73 0 14 12 166 17 122 110 71 142 163 116 42 0 0 0 00 0 0 0 33 2 132 165 0 71 135 105 163 46 7 164 179 88 12 6 137 173 2 10235 124 13 109 2 29 179 106 43 0 0 0 0 0 0 0 0 34 0 147 173 0 29 37 11197 184 12 85 177 19 201 25 41 191 135 13 36 12 78 69 114 162 193 141 440 0 0 0 0 0 0 0 35 1 57 77 0 91 60 126 157 85 5 40 184 157 165 137 152167 225 11 63 18 6 55 93 172 181 175 45 0 0 0 0 0 0 0 0 36 0 140 25 0 1121 73 197 178 2 38 151 63 175 129 154 167 112 7 154 170 82 83 26 129179 106 46 0 0 0 0 0 0 0 0 37 10 219 37 0 40 97 167 181 154 13 151 31144 12 56 38 193 114 47 0 0 0 0 0 0 0 0 38 1 31 84 0 37 1 112 157 42 566 151 93 97 70 7 173 41 11 38 190 19 46 1 19 191 105 48 0 0 0 0 0 0 0 039 0 239 93 0 106 119 109 181 167 7 172 132 24 181 32 6 157 45 12 34 57138 154 142 105 173 189 49 0 0 0 0 0 0 0 0 40 2 0 103 0 98 6 160 193 7810 75 107 36 35 73 156 163 67 13 120 163 143 36 102 82 179 180 50 0 0 00 0 0 0 0 41 1 129 147 0 120 48 132 191 53 5 229 7 2 101 47 6 197 215 11118 60 55 81 19 8 167 230 51 0 0 0 0 0 0 0 0

In step S206, interleaving is performed. The interleaving is tointerleave the LDPC codeword sequence to obtain an interleaved LDPCcodeword sequence. The interleaving method includes: performing blockinterleaving on the LDPC codeword sequence, where the number of rows ofthe interleaving matrix is determined according to the quasi-cyclic LDPCencoding parameter, and the quasi-cyclic LDPC encoding parameterincludes at least one of: a lifting size, the total number of columns ofa base graph matrix, the total number of rows of the base graph matrix,or the number of system columns of the base graph matrix.

In one specific embodiment, the number of rows of the interleavingmatrix is equal to a positive integer factor of the quasi-cyclic LDPClifting size, or is equal to a positive integer multiple of a liftingsize of the quasi-cyclic LDPC encoding.

In one specific embodiment, the number of rows of the interleavingmatrix is equal to a positive integer factor of the total number ofcolumns of the base graph matrix of the quasi-cyclic LDPC encoding, oris equal to a positive integer multiple of the total number of columnsof the base graph matrix of the quasi-cyclic LDPC encoding.

In one specific embodiment, the interleaving matrix is interleaved in amanner in which data in the matrix is inputted along the column andoutputted along the column.

In one specific embodiment, in the interleaving method, outputting isperformed according to a predetermined column order to obtain theinterleaved codeword sequence.

In one specific embodiment, in the interleaving method, intra-columninterleaving is performed on the columns in the interleaving matrix,where the intra-column interleaving method includes: cyclic shiftinterleaving and random sequence interleaving. Preferably, theintra-column interleaving method is determined according to a modulationorder. Preferably, in condition that the modulation order is greaterthan 2, the intra-column interleaving method is executed.

The interleaving method includes: mapping all bits from the S0-th bit tothe S1-th bit in the LDPC codeword sequence onto bits from the S0-th bitto the S1-th bit of the interleaved codeword sequence according to apredetermined interleaving index sequence, where S0 is a positiveinteger, and S1 is an integer greater than the S0.

The predetermined interleaving index sequence is obtained in a blockinterleaving manner, the number of columns of the block interleavingmatrix is Z0, and Z0 is a positive integer.

In one more specific embodiment, Z0 is equal to a positive integerfactor of the LDPC encoding lifting size.

In one more specific embodiment, Z0 is equal to Z, Z is the LDPCencoding lifting size, S0 is equal to 2×Z, and S1 is equal to E×Z−1,where the E is an integer greater than 2. Furthermore, the E is equal tokb, kb+1, kb+2, kb+3 or kb+4, where the kb is the number of systemcolumns of the base graph matrix of the LDPC encoding.

Preferably, in one more specific embodiment, S0 is equal to kb×Z, and S1is equal to E×Z−1, where Z is the LDPC encoding lifting size, the E isequal to kb+Δmb, the Δmb is an integer greater than 0, and the kb is thenumber of system columns of the base graph matrix of the LDPC encoding.Furthermore, the Δmb is determined according one of followingcombinations of parameters: combination 1, composed of the number ofsystem columns of the base graph matrix of the LDPC encoding and anencoding rate; combination 2, composed of the length of the informationpacket bit sequence, the length of the bit sequence to be transmitted,and the LDPC encoding lifting size; and combination 3, composed of thenumber of LDPC code check bits contained in the bit sequence to betransmitted and the LDPC encoding lifting size.

In one more specific embodiment, Z0 is determined by followingparameters: S0, S1 and a modulation order, where the modulation order isthe number of bits carried by each modulation symbol. Preferably, Z0 iscalculated via the following formula:

${{Z0} = \lceil \frac{( {{S1} - {S0} + 1} )}{M} \rceil},$where the M is the modulation order and is a positive integer.

In one more specific embodiment, the specific value of S1 is determinedby following parameters: the length of the information packet bitsequence, and the length of the bit sequence to be transmitted.

In one more specific embodiment, when the code rate R is less than orequal to R0, the block interleaving is performed, where the R0 is a realnumber greater than or equal to ¾ and less than 1, and the code rate Ris equal to a value obtained after the length of the information packetbit sequence is divided by the length of the bit sequence to betransmitted.

The above interleaving method has following benefic effects: the LDPCcodeword can be effectively randomized, the LDPC code can obtain betterperformance advantages in the high-order modulation (e.g., 64 quadratureamplitude modulation (QAM) and 256 QAM), and the performance of the LDPCcode in the fading channel can be effectively improved.

In step S207, rate matching is performed. Cyclic bit selection isperformed on the interleaved LDPC codeword sequence from a startingposition to obtain a rate-matched codeword sequence. The startingposition is determined according to a predetermined parameter, where thepredetermined parameter includes at least one of: a redundancy version,a lifting size, the total number of columns of the base graph matrix,the total number of rows of the base graph matrix, the number of systemcolumns of the base graph matrix or a length of the information packetbit sequence.

In one more specific embodiment, the starting position is determinedaccording to the redundancy version, the lifting size and the totalnumber of columns of the base graph matrix. Furthermore, the startingposition corresponding to the redundancy version being RV_(i) iscalculated via the following formula:S _(i)=α×function(β×(nb/G)×RV_(i)+χ)×Z+δ,

where, in the formula, the nb is the total number of columns of the basegraph matrix, Z is the lifting size, α is a positive integer, G is areal number greater than 0, β is a positive real number, χ is anonnegative real number, and δ is an integer, where the function(x)represents rounding the real number x up to, or down to, or to a nearestinteger.

Furthermore, the starting position corresponding to the redundancyversion being RV_(i) is calculated via the following formula:S_(i)=α×(β×function(λ×nb/G)×RV_(i)+χ)×Z+δ.

Where in the formula, the nb is the total number of columns of the basegraph matrix, Z is the lifting size, α is a positive integer, G is areal number greater than 0, β is a positive integer, the λ is a positivereal number, χ is a nonnegative real number, and δ is an integer, wherethe function(x) represents rounding the real number x up to, or down to,or to a nearest integer.

Furthermore, the starting position corresponding to the redundancyversion being RV_(i) is calculated via the following formula:S_(i)=α×(β×function(λ×nb×Z/G)×RV_(i)+χ)+δ.

Where in the formula, nb is the total number of columns of the basegraph matrix, Z is the lifting size, G is a real number greater than 0,α is a positive integer, β is a positive integer, λ is a positive realnumber, χ is a nonnegative real number, and δ is an integer. Where thefunction(x) represents rounding the real number x up to, or down to, orto a nearest integer.

In one more specific embodiment, the starting position is determinedaccording to the redundancy version, the lifting size, the total numberof rows of the base graph matrix, and the length of the informationpacket bit sequence. Furthermore, the starting position corresponding tothe redundancy version being RV_(i) is calculated via one of followingformulas: S_(i)=α×(β×function((K+mb×Z)/G)×RV_(i)+χ)+δ; andS_(i)=α×(β×function((K+mb×Z)/G)+χ)×RV_(i)+δ,

Where in the above formulas, K is the length of the information packetbit sequence, Z is the lifting size, G is a real number greater than 0,α is a positive integer, β is a positive integer, λ is a positive realnumber, χ is a nonnegative real number, and δ is an integer, where thefunction(x) represents rounding the real number x up to, or down to, orto a nearest integer.

The cyclic bit selection is performed on the interleaved codewordsequence. Bits from the 2×Z-th bit to the tail bit in the interleavedcodeword sequence are stored in one circular buffer, and N bits areobtained sequentially from the circular buffer according to theredundancy version to form the bit sequence to be transmitted.

In step S208, constellation modulation is performed. The bit sequence tobe transmitted is divided into a plurality of bit packets, the pluralityof bit packets is mapped onto a constellation modulation symbol, and theconstellation modulation symbol is sent. In a preferred embodiment,before the plurality of bit packets is mapped onto the constellationmodulation symbol, bits in the bit packet are interleaved respectively,and the each interleaved bit packet is mapped onto the constellationmodulation symbol. The modulation order of the constellation modulationsymbol is M, and the modulation order represents the number of bitscarried by each constellation modulation symbol. The constellationsymbol modulation includes one of the following: binary phase shiftkeying (BPSK), quadrature phase shift keying (QPSK), 16 QAM, 64 QAM or256 QAM, and the corresponding modulation orders are 1, 2, 4, 6, and 8respectively. Preferably, in one specific embodiment, the intra-bitpacket interleaving is determined according to the modulation order. Forexample, in condition that the modulation order is greater than M1, theinterleaving method is executed, where the M1 is equal to 2, 3, 4, 5 or6. Preferably, the intra-bit packet interleaving includes: cyclic shiftinterleaving and random index sequence interleaving. Preferably, theinterleaving methods of any adjacent F constellation symbols in allconstellation modulation symbols are different, where the F is apositive integer. In another embodiment, G0 intra-bit packetinterleaving methods exist, and the G0 methods are different. Theintra-bit packet bit interleaving selects G1 methods from the G0 methodsto interleave bits in each bit packet according to a certain ordersequentially. In another embodiment, a plurality of intra-bit packetinterleaving method sets exists, and the intra-bit packet interleavingmethod is determined from the plurality of interleaving method setsaccording to the modulation order.

From the description of the above-mentioned embodiments, it will beapparent to those skilled in the art that the method in the embodimentsdescribed above may be implemented by software plus a necessarygeneral-purpose hardware platform, or may of course be implemented byhardware. However, in many cases, the former is a preferredimplementation manner. Based on this understanding, the solutionsprovided by the present invention substantially, or the partcontributing to the related art, may be embodied in the form of asoftware product. The computer software product is stored in a storagemedium (such as a read only memory (ROM)/random access memory (RAM), amagnetic disk or an optical disk) and includes several instructions forenabling a terminal device (which may be a mobile phone, a computer, aserver, a network device or the like) to execute the method according toeach embodiment of the present disclosure.

Embodiment Two

The embodiment further provides a data encoding device. The device isused for implementing the above-mentioned embodiments and preferredimplementations, and what has been described will not be repeated. Asused below, the term “module” may be software, hardware or a combinationthereof capable of implementing predetermined functions. The device inthe embodiment described below is preferably implemented by software,but implementation by hardware or by a combination of software andhardware is also possible and conceived.

According to another embodiment of the present invention, a dataencoding device is further provided. The device includes an obtainingmodule, an interleaving module, a selecting module and a sending module.

The obtaining module is configured to obtain data to be sent.

The interleaving module is connected to the obtaining module andconfigured to perform quasi-cyclic LDPC encoding on the data to be sentto obtain an LDPC codeword sequence, and interleave the LDPC codewordsequence to obtain an interleaved LDPC codeword sequence.

The selecting module is connected to the interleaving module andconfigured to perform cyclic bit selection on the interleaved LDPCcodeword sequence from a starting position to obtain a rate-matchedcodeword sequence, where the starting position is determined accordingto a predetermined parameter, where the predetermined parameter includesat least one of: a redundancy version, a lifting size, the total numberof columns of a base graph matrix, the total number of rows of the basegraph matrix, the number of system columns of the base graph matrix or alength of an information packet bit sequence.

The sending module is connected to the selecting module and configuredto send the rate-matched codeword sequence.

It is to be added that steps of the method in the embodiment 1 can beexecuted by the device in this embodiment.

It is to be noted that the various modules described above may beimplemented by software or hardware. Implementation by hardware may, butmay not necessarily, be performed in the following manners: the variousmodules described above are located in a same processor, or the variousmodules described above are located in their respective processors inany combination form.

Embodiment Three

According to another embodiment of the present invention, a processor isfurther provided. The processor is used for executing programs which,when executed, execute the method of any one of the optional embodimentsdescribed above.

Embodiment Four

According to another embodiment of the present invention, a storagemedium is further provided. The storage medium includes stored programswhich, when executed, execute the method of any one of the optionalembodiments described above.

Apparently, it should be understood by those skilled in the art thateach of the above-mentioned modules or steps of the present inventionmay be implemented by a general-purpose computing device, the modules orsteps may be concentrated on a single computing device or distributed ona network composed of multiple computing devices, and alternatively, themodules or steps may be implemented by program codes executable by thecomputing devices, so that the modules or steps may be stored in astorage device and executed by the computing device. In somecircumstances, the illustrated or described steps may be executed insequences different from those described herein, or the modules or stepsmay be made into various integrated circuit modules separately, ormultiple modules or steps therein may be made into a single integratedcircuit module for implementation. In this way, the present invention isnot limited to any specific combination of hardware and software.

The above are only preferred embodiments of the present invention andare not intended to limit the present invention. For those skilled inthe art, the present invention may have various modifications andvariations. Any modifications, equivalent substitutions, improvementsand the like made within the spirit and principle of the presentinvention should fall within the scope of the present invention.

What is claimed is:
 1. A low-density parity-check (LDPC) data encodingmethod, comprising: obtaining an LDPC codeword sequence by performingLDPC encoding on an information packet bit sequence; obtaining aninterleaved LDPC codeword sequence by interleaving the LDPC codewordsequence, wherein the obtaining the interleaved LDPC codeword sequenceincludes: mapping bits from a S0-th bit to a S1-th bit in the LDPCcodeword sequence to bits from a S0-th bit to a S1-th bit of theinterleaved LDPC codeword sequence according to a predeterminedinterleaving index sequence, wherein S0 is a positive integer, and S1 isan integer greater than S0, wherein S0 is equal to 2×Z, where Z is alifting size, and wherein S1 is determined using a length of theinformation packet bit sequence or a length of a bit sequence to betransmitted; obtaining a rate-matched codeword sequence by performing acyclic bit selection on the interleaved LDPC codeword sequence from astarting position; and sending the rate-matched codeword sequence. 2.The LDPC data encoding method of claim 1, wherein the starting positionis determined according to a redundancy version, the lifting size, andthe length of the information packet bit sequence.
 3. The LDPC dataencoding method of claim 1, wherein the starting position correspondingto a redundancy version being RV_(i) is calculated via the followingformula:a first formula:S _(i)=α×function(β×(nb/G)×RV_(i)+χ)×Z+δ; wherein in thefirst formula, nb is a total number of columns of a base graph matrix, Zis the lifting size, a is a positive integer, G is a real number greaterthan 0, β is a positive real number, χ is a nonnegative real number, andδ is an integer, wherein the function(x) represents rounding a realnumber x up to, or down to, or to a nearest integer.
 4. The LDPC dataencoding method of claim 1, wherein the starting position correspondingto a redundancy version being RV_(i) is calculated via the followingformula:a second formula:S _(i)=α×(β×function(λ×nb/G)×RV_(i)+χ)×Z+δ; wherein, inthe second formula, nb is a total number of columns of a base graphmatrix, Z is the lifting size, α is a positive integer, G is a realnumber greater than 0, β is a positive integer, λ is a positive realnumber, χ is a nonnegative real number, and δ is an integer, wherein thefunction(x) represents rounding the real number x up to, or down to, orto a nearest integer.
 5. The LDPC data encoding method of claim 1,wherein the starting position corresponding to a redundancy versionbeing RV_(i) is calculated via the following formula:a third formula:S _(i)=α×(β×function(λ×nb×Z/G)×RV_(i)+χ)+δ; wherein, inthe third formula, wherein nb is a total number of columns of a basegraph matrix, Z is the lifting size, G is a real number greater than 0,α is a positive integer, β is a positive integer, λ is a positive realnumber, χ is a nonnegative real number, and δ is an integer, wherein thefunction(x) represents rounding the real number x up to, or down to, orto a nearest integer.
 6. The LDPC data encoding method of claim 1,wherein the predetermined interleaving index sequence is obtained by ablock interleaving manner, wherein a number of columns of a blockinterleaving matrix is Z₀, wherein Z0 is determined by a quasi-cyclicLDPC encoding parameter, and wherein the quasi-cyclic LDPC encodingparameter comprises at least one of: the lifting size, a total number ofcolumns of a base graph matrix, a total number of rows of the base graphmatrix, a number of system columns of the base graph matrix, or thelength of the information packet bit sequence.
 7. The LDPC data encodingmethod of claim 1, wherein S1 is equal to a positive integer multiple ofthe lifting size.
 8. The LDPC data encoding method of claim 1, whereinthe sending the rate-matched codeword sequence comprises: dividing therate-matched codeword sequence into a plurality of bit packets,interleaving bits in each bit packet of the plurality of bit packetsrespectively, and mapping each interleaved bit packet to a constellationmodulation symbol.
 9. An apparatus comprising a processor, which isconfigured to execute programs, wherein, when executed, the programsexecute a method comprising: obtain a low-density parity check (LDPC)codeword sequence by performing LDPC encoding on an information packetbit sequence; obtain an interleaved LDPC codeword sequence byinterleaving the LDPC codeword sequence, wherein the obtain theinterleaved LDPC codeword sequence includes: map bits from a S0-th bitto a S1-th bit in the LDPC codeword sequence to bits from a S0-th bit toa S1-th bit of the interleaved LDPC codeword sequence according to apredetermined interleaving index sequence, wherein S0 is a positiveinteger, and S1 is an integer greater than S0, wherein S0 is equal to2×Z, where Z is a lifting size, and wherein S1 is determined using alength of the information packet bit sequence or a length of a bitsequence to be transmitted; obtain a rate-matched codeword sequence byperforming a cyclic bit selection on the interleaved LDPC codewordsequence from a starting position; and send the rate-matched codewordsequence.
 10. The apparatus of claim 9, wherein the starting position isdetermined according to a redundancy version, the lifting size, and thelength of the information packet bit sequence.
 11. The apparatus ofclaim 9, wherein the starting position corresponding to a redundancyversion being RV_(i) is calculated via the following formula:a first formula:S _(i)=α×function(β×(nb/G)×RV_(i)+χ)×Z+δ; wherein in thefirst formula, nb is a total number of columns of a base graph matrix, Zis the lifting size, α is a positive integer, G is a real number greaterthan 0, β is a positive real number, χ is a nonnegative real number, andδ is an integer, wherein the function(x) represents rounding a realnumber x up to, or down to, or to a nearest integer.
 12. The apparatusof claim 9, wherein the starting position corresponding to a redundancyversion being RV_(i) is calculated via the following formula:a second formula:S _(i)=α×(β×function(λ×nb/G)×RV_(i)+χ)×Z+δ; wherein, inthe second formula, nb is a total number of columns of a base graphmatrix, Z is the lifting size, α is a positive integer, G is a realnumber greater than 0, β is a positive integer, λ is a positive realnumber, χ is a nonnegative real number, and δ is an integer, wherein thefunction(x) represents rounding the real number x up to, or down to, orto a nearest integer.
 13. The apparatus of claim 9, wherein the startingposition corresponding to a redundancy version being RV_(i) iscalculated via the following formula:a third formula:S _(i)=α×(β×function(λ×nb×Z/G)×RV_(i)+χ)+δ; wherein, inthe third formula, wherein nb is a total number of columns of a basegraph matrix, Z is the lifting size, G is a real number greater than 0,α is a positive integer, β is a positive integer, λ is a positive realnumber, χ is a nonnegative real number, and δ is an integer, wherein thefunction(x) represents rounding the real number x up to, or down to, orto a nearest integer.
 14. The apparatus of claim 9, wherein thepredetermined interleaving index sequence is obtained by a blockinterleaving manner, wherein a number of columns of a block interleavingmatrix is Z₀, wherein Z0 is determined by a quasi-cyclic LDPC encodingparameter, and wherein the quasi-cyclic LDPC encoding parametercomprises at least one of: the lifting size, a total number of columnsof a base graph matrix, a total number of rows of the base graph matrix,a number of system columns of the base graph matrix, or the length ofthe information packet bit sequence.
 15. The apparatus of claim 9,wherein S1 is equal to a positive integer multiple of the lifting size.16. The apparatus of claim 9, wherein the send the rate-matched codewordsequence comprises: divide the rate-matched codeword sequence into aplurality of bit packets, interleave bits in each bit packet of theplurality of bit packets respectively, and map each interleaved bitpacket to a constellation modulation symbol.
 17. A non-transitorystorage medium, comprising stored programs, wherein, when executed, theprograms execute a method comprising: obtaining an LDPC codewordsequence by performing LDPC encoding on an information packet bitsequence; obtaining an interleaved LDPC codeword sequence byinterleaving the LDPC codeword sequence, wherein the obtaining theinterleaved LDPC codeword sequence includes: mapping bits from a S0-thbit to a S1-th bit in the LDPC codeword sequence to bits from a S0-thbit to a S1-th bit of the interleaved LDPC codeword sequence accordingto a predetermined interleaving index sequence, wherein S0 is a positiveinteger, and S1 is an integer greater than S0, wherein S0 is equal to2×Z, where Z is a lifting size, and wherein S1 is determined using alength of the information packet bit sequence or a length of a bitsequence to be transmitted; obtaining a rate-matched codeword sequenceby performing a cyclic bit selection on the interleaved LDPC codewordsequence from a starting position; and sending the rate-matched codewordsequence.
 18. The non-transitory storage medium of claim 17, wherein thestarting position is determined according to a redundancy version, thelifting size, and the length of the information packet bit sequence. 19.The non-transitory storage medium of claim 17, wherein the startingposition corresponding to a redundancy version being RV_(i) iscalculated via the following formula:a first formula:S _(i)=α×function(β×(nb/G)×RV_(i)+χ)×Z+δ; wherein in thefirst formula, nb is a total number of columns of a base graph matrix, Zis the lifting size, α is a positive integer, G is a real number greaterthan 0, β is a positive real number, χ is a nonnegative real number, andδ is an integer, wherein the function(x) represents rounding a realnumber x up to, or down to, or to a nearest integer.
 20. Thenon-transitory storage medium of claim 17, wherein the starting positioncorresponding to a redundancy version being RV_(i) is calculated via thefollowing formula:a second formula:S _(i)=α×(β×function(λ×nb/G)×RV_(i)+χ)×Z+δ; wherein, inthe second formula, nb is a total number of columns of a base graphmatrix, Z is the lifting size, α is a positive integer, G is a realnumber greater than 0, β is a positive integer, λ is a positive realnumber, χ is a nonnegative real number, and δ is an integer, wherein thefunction(x) represents rounding the real number x up to, or down to, orto a nearest integer.